Estimation under matrix quadratic loss and matrix superharmonicity

نویسندگان

چکیده

Summary We investigate estimation of a normal mean matrix under the quadratic loss. Improved loss implies improved any linear combination columns First, an unbiased estimate risk is derived and Efron–Morris estimator shown to be minimax. Next, notion superharmonicity for matrix-variate functions introduced have properties analogous those usual superharmonic functions, which may independent interest. Then, it that generalized Bayes with respect prior also provide class priors includes previously proposed generalization Stein’s prior. Numerical results demonstrate work well low-rank matrices.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On matrix estimation under monotonicity constraints

Abstract: We consider the problem of estimating an unknown n1×n2 matrix θ∗ from noisy observations under the constraint that θ∗ is nondecreasing in both rows and columns. We consider the least squares estimator (LSE) in this setting and study its risk properties. We show that the worst case risk of the LSE is n−1/2, up to multiplicative logarithmic factors, where n = n1n2 and that the LSE is mi...

متن کامل

Triangularizing Quadratic Matrix Polynomials

We show that any regular quadratic matrix polynomial can be reduced to an upper triangular quadratic matrix polynomial over the complex numbers preserving the finite and infinite elementary divisors. We characterize the real quadratic matrix polynomials that are triangularizable over the real numbers and show that those that are not triangularizable are quasi-triangularizable with diagonal bloc...

متن کامل

Quadratic Matrix Programming

We introduce and study a special class of nonconvex quadratic problems in which the objective and constraint functions have the form f(X) = Tr(XAX)+2Tr(BX)+c,X ∈ RRn×r. The latter formulation is termed quadratic matrix programming (QMP) of order r. We construct a specially devised semidefinite relaxation (SDR) and dual for the QMP problem and show that under some mild conditions strong duality ...

متن کامل

Quadratic nonnegative matrix factorization

In Nonnegative Matrix Factorization (NMF), a nonnegative matrix is approximated by a product of lower-rank factorizing matrices. Most NMF methods assume that each factorizing matrix appears only once in the approximation, thus the approximation is linear in the factorizing matrices. We present a new class of approximative NMF methods, called Quadratic Nonnegative Matrix Factorization (QNMF), wh...

متن کامل

Sparse Inverse Covariance Matrix Estimation Using Quadratic Approximation

The l1 regularized Gaussian maximum likelihood estimator has been shown to have strong statistical guarantees in recovering a sparse inverse covariance matrix, or alternatively the underlying graph structure of a Gaussian Markov Random Field, from very limited samples. We propose a novel algorithm for solving the resulting optimization problem which is a regularized log-determinant program. In ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Biometrika

سال: 2021

ISSN: ['0006-3444', '1464-3510']

DOI: https://doi.org/10.1093/biomet/asab025